Relating Church-Style and Curry-Style Subtyping
نویسندگان
چکیده
منابع مشابه
Relating Church-Style and Curry-Style Subtyping
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context. A complication for these systems is that bounds declared in the context do not interact well with the logical relation proof of completeness or termination. This paper proposes a natural modification to the type syntax for Fω...
متن کاملDecidable structures between Church-style and Curry-style
It is well-known that the type-checking and type-inference problems are undecidable for second order λ-calculus in Curry-style, although those for Church-style are decidable. What causes the differences in decidability and undecidability on the problems? We examine crucial conditions on terms for the (un)decidability property from the viewpoint of partially typed terms, and what kinds of type a...
متن کاملPractical Subtyping for Curry-Style Languages
We present a new, syntax-directed framework for Curry style type-systems with subtyping. It supports a rich set of features, and allows for a reasonably simple theory and implementation. The system we consider has sum and product types, universal and existential quantifiers, inductive and coinductive types. The latter two may carry size invariants that can be used to establish the termination o...
متن کاملOn the relation between Church - style typing and Curry - style typing : Extended Abstract ∗
There are two versions of type assignment in λ-calculus: Church-style, in which the type of each variable is fixed, and Curry-style (also called “domain free”), in which it is not. As an example, in Church-style typing, λx : A . x is the identity function on type A, and it has type A → A but not B → B for a type B different from A. In Curry-style typing, λx.x is a general identity function with...
متن کاملExistential type systems between Church and Curry style (type-free style)
We study type checking, typability, and type inference problems for type-free style and Curry style second-order existential systems where the type-free style differs from the Curry style in that the terms of the former contain information on where the existential quantifier elimination and introduction take place but omit the information on which types are involved. We show that all the proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.45.1